Vertex ordering and partitioning problems for random spatial graphs
نویسندگان
چکیده
منابع مشابه
Fast algorithms for vertex subset and vertex partitioning problems on graphs of low boolean-width⋆
We consider the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rankwidth, which is related to the number of GF [2]-sums (1+1=0) of neighborhoods instead of the Boolean-sums (1+1=1) used for boolean-width. It compares well to the other four well-known width parameters tree-width, branch-width, clique-...
متن کاملComputational techniques for vertex partitioning of graphs
A powerful vertex-partitioning algorithm is developed and applied for vertex partitioning of graphs of chemical and spectroscopic interest. The codes developed on the basis of these algorithms are tested and compared for performance with other methods based on the Morgan algorithm and the principal eigenvector algorithm based on the Givens-Householder method. The newly developed algorithm and c...
متن کاملVertex Ordering, Clustering, and Their Application to Graph Partitioning
We propose a new heuristic for vertex ordering and a method that splits the vertex ordering into clusters. We apply them to the graph partitioning problem. The application of these ideas incorporates reordering in genetic algorithms and the identification of clustered structures in graphs. Experimental tests on benchmark graphs showed that the new vertex-ordering scheme performed better than ex...
متن کاملHypergraph Partitioning through Vertex Separators on Graphs
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inheren...
متن کاملOn Vertex, Edge, and Vertex-Edge Random Graphs (Extended Abstract)
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdős-Rényi random graphs [9, 10], vertex random graphs are generalizations of geometric random graphs [21], and vertex-edge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2000
ISSN: 1050-5164
DOI: 10.1214/aoap/1019487353